A result on Hamiltonian line graphs involving restrictions on induced subgraphs
نویسنده
چکیده
It is shown that the existence of a Hamilton cycle in the line graph of a graph G can be ensured by imposing certain restrictions on certain induced subgraphs of G. Thereby a number of known results on hamiltonian line graphs are improved, including the earliest results in terms of vertex degrees. One particular consequence is that every graph of diameter 2 and order at least 4 has a hamiltonian line graph.
منابع مشابه
On the number of specific spanning subgraphs of the graphs G x Pn
This paper investigates the number of spanning subgraphs of the product of an arbitrary graph G with the path graphs Pn on n vertices that meet certain properties: connectivity, acyclicity, Hamiltonicity, and restrictions on degree. A general method is presented for constructing a recurrence equation R(n) for the graphs G Pn, giving the number of spanning subgraphs that satisfy a given combinat...
متن کاملLine Graphs and Forbidden Induced Subgraphs
Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, S8 olte s gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases. A graph is said to be a dumbbell if it consists of two complete graphs sharing exactly one common edge. In this paper, we show that a graph...
متن کاملHamiltonian Connected Graphs Involving Forbidden Subgraphs
We consider the pair of graphs S and T such that every 3-connected {S, T}-free graph is hamiltonian connected. Such pairs are called hamiltonian connected pairs. We show three new hamiltonian connected pairs. Combing our results and a result of Shepherd, we conclude that if {S, T} is a pair of graphs such that every 2-connected {S, T}-free graph is hamiltonian then every 3-connected {S, T}-free...
متن کاملClaw-free 3-connected P11-free graphs are hamiltonian
We show that every 3-connected claw-free graph which contains no induced copy of P11 is hamiltonian. Since there exist non-hamiltonian 3-connected claw-free graphs without induced copies of P12 this result is, in a way, best possible. 1. Statement of the main result A graph G is {H1, H2, . . . Hk}-free if G contains no induced subgraphs isomorphic to any of the graphs Hi, i = 1, 2, . . . , k. A...
متن کاملPairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs
A graph G on n vertices is Hamiltonian if it contains a spanning cycle, and pancyclic if it contains cycles of all lengths from 3 to n. In 1984, Fan presented a degree condition involving every pair of vertices at distance two for a 2-connected graph to be Hamiltonian. Motivated by Fan’s result, we say that an induced subgraph H of G is f1-heavy if for every pair of vertices u, v ∈ V (H), dH(u,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Graph Theory
دوره 12 شماره
صفحات -
تاریخ انتشار 1988